An Introduction to Input Output Automata
نویسندگان
چکیده
The input output automaton model has recently been de ned in LT LT as a tool for modeling concurrent and distributed discrete event systems of the sorts arising in computer science Since its introduction the model has been used for describing and reasoning about several di erent types of systems including network resource allocation algorithms communication algorithms concurrent database systems shared atomic objects and data ow architectures This paper is intended to introduce researchers to the model It is orga nized as follows Section contains an overview of the model Section de nes the model formally and examines several illustrative examples concerning candy vending machines Section contains a second example a leader election algo rithm Finally Section contains a survey of some of the uses that have so far been made of the model
منابع مشابه
DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملSynthesis: Words and Traces
The problem of synthesising a reactive system is discussed. The most standard instance of this problem ask to construct a finite input-output automaton satisfying a given regular specification. During fifty years since its introduction by Church, numerous extensions of the initial formulation have been considered. One particularly challenging case is that of distributed synthesis where a constr...
متن کاملAn Introduction to Pervasive Interface Automata
Pervasive systems are often context-dependent, component based systems in which components expose interfaces and offer one or more services. These systems may evolve in unpredictable ways, often through component replacement. We present pervasive interface automata as a formalism for modelling components and their composition. Pervasive interface automata are based on the interface automata of ...
متن کاملOn Weakly Invertible Semi - input - memory Finite Automata with Delay 2
Semi-input-memory finite automata are a generalization of input-memory finite automata by appending an autonomous finite automaton component. This paper gives a decision criterion of weakly invertible semi-input-memory finite automata with delay 2 of which the minimal output weight of length 2 and the sizes of input and output alphabets are identical. The results are used to generate a kind of ...
متن کاملA Proof of the Kahn Principle for Input/Output Automata
We use input/output automata to de ne a simple and general model of networks of concurrently executing, nondeterministic processes that communicate through unidirectional, named ports. A notion of the input/output relation computed by a process is de ned, and determinate processes are de ned to be processes whose input/output relations are single-valued. We show that determinate processes compu...
متن کاملA fault modeling approach for Input/Output Automata
This paper presents a new approach for modeling a discrete-event systems under the presence of faults. Input/Output automata are used to represent the nominal and faulty behavior of a plant for fault detection and identification. Assuming that a model of the nominal behavior of a plant is available, it is usually a nontrivial task to derive a model of the plant subject to actuator, sensor and s...
متن کامل